Search for: All records

Computational modeling of assembly is challenging for many systems, because their timescales can vastly exceed those accessible to simulations. This article describes the multiMSM, which is a general framework that uses Markov state models (MSMs) to enable simulating self-assembly and self-organization of finite-sized structures on timescales that are orders of magnitude longer than those accessible to brute-force dynamics simulations. As with traditional MSM approaches, the method efficiently overcomes free energy barriers and other dynamical bottlenecks. In contrast to previous MSM approaches to simulating assembly, the framework describes simultaneous assembly of many clusters and the consequent depletion of free subunits or other small oligomers. The algorithm accounts for changes in transition rates as concentrations of monomers and intermediates evolve over the course of the reaction. Using two model systems, we show that the multiMSM accurately predicts the concentrations of the full ensemble of intermediates on timescales required to reach equilibrium. Importantly, after constructing a multiMSM for one system concentration, yields at other concentrations can be approximately calculated without any further sampling. This capability allows for orders of magnitude additional speedup. In addition, the method enables highly efficient calculation of quantities such as free energy profiles, nucleation timescales, flux along the ensemble of assembly pathways, and entropy production rates. Identifying contributions of individual transitions to entropy production rates reveals sources of kinetic traps. The method is broadly applicable to systems with equilibrium or nonequilibrium dynamics and is trivially parallelizable and, thus, highly scalable. Published by the American Physical Society2024 

Self-assembly of complex and functional materials remains a grand challenge in soft material science. Efficient assembly depends on a delicate balance between thermodynamic and kinetic effects, requiring fine-tuning affinities and concentrations of subunits. By contrast, we introduce an assembly paradigm that allows large error-tolerance in the subunit affinity and helps avoid kinetic traps. Our combined experimental and computational approach uses a model system of triangular subunits programmed to assemble intoT= 3 icosahedral capsids comprising 60 units. The experimental platform uses DNA origami to create monodisperse colloids whose three-dimensional geometry is controlled to nanometer precision, with two distinct bonds whose affinities are controlled tok_BTprecision, quantified in situ by static light scattering. The computational model uses a coarse-grained representation of subunits, short-ranged potentials, and Langevin dynamics. Experimental observations and modeling reveal that when the bond affinities are unequal, two distincthierarchicalassembly pathways occur, in which the subunits first form dimers in one case and pentamers in another. These hierarchical pathways produce complete capsids faster and are more robust against affinity variation than egalitarian pathways, in which all binding sites have equal strengths. This finding suggests that hierarchical assembly may be a general engineering principle for optimizing self-assembly of complex target structures. 

The promise of self-assembly to enable the bottom-up formation of materials with prescribed architectures and functions has driven intensive efforts to uncover rational design principles for maximizing the yield of a target structure. Yet, despite many successful examples of self-assembly, ensuring kinetic accessibility of the target structure remains an unsolved problem in many systems. In particular, long-lived kinetic traps can result in assembly times that vastly exceed experimentally accessible timescales. One proposed solution is to design non-equilibrium assembly protocols in which system parameters change over time to avoid such kinetic traps. Here, we develop a framework to combine Markov state model (MSM) analysis with optimal control theory to compute a time-dependent protocol that maximizes the yield of the target structure at a finite time. We present an adjoint-based gradient descent method that, in conjunction with MSMs for a system as a function of its control parameters, enables efficiently optimizing the assembly protocol. We also describe an interpolation approach to significantly reduce the number of simulations required to construct the MSMs. We demonstrate our approach with two examples; a simple semi-analytic model for the folding of a polymer of colloidal particles, and a more complex model for capsid assembly. Our results show that optimizing time-dependent protocols can achieve significant improvements in the yields of selected structures, including equilibrium free energy minima, long-lived metastable structures, and transient states.